Gathering Autonomous Mobile Robots
نویسندگان
چکیده
We study the problem of coordinating a set of autonomous mobile robots that can freely move in a two-dimensional plane; in particular, we want them to gather at a point not fixed in advance (GATHERING PROBLEM). We introduce a model of weak robots (decentralized, asynchronous, no common knowledge, no identities, no central coordination, no direct communication, oblivious) which can observe the set of all points in the plane which are occupied by other robots. Based on this observation, a robot uses a deterministic algorithm to compute a destination, and moves there. We prove that these robots are too weak to gather at a point in finite time. Therefore, we strengthen them with the ability to detect whether more than one robot is at a point (multiplicity). We analyze the GATHERING PROBLEM for these stronger robots. We show that the problem is still unsolvable if there are only two robots in the system. For 3 and 4 robots, we give algorithms that solve the GATHERING PROBLEM. For more than 4 robots, we present an algorithm that gathers the robots in finite time if they are not in a specific symmetric configuration at the beginning (biangular configuration). We show how to solve such initial configurations separately. However, the general solution of the GATHERING PROBLEM remains an open problem.
منابع مشابه
Are Autonomous Mobile Robots Able to Take Over Construction? A Review
Although construction has been known as a highly complex application field for autonomous robotic systems, recent advances in this field offer great hope for using robotic capabilities to develop automated construction. Today, space research agencies seek to build infrastructures without human intervention, and construction companies look to robots with the potential to improve construction qua...
متن کاملWait-Free Gathering of Mobile Robots
The problem of gathering multiple mobile robots to a single location, is one of the fundamental problems in distributed coordination between autonomous robots. The problem has been studied and solved even for robots that are anonymous, disoriented, memoryless and operate in the semi-synchronous (ATOM) model. However all known solutions require the robots to be faulty-free except for the results...
متن کاملEffective Mechatronic Models and Methods for Implementation an Autonomous Soccer Robot
Omni directional mobile robots have been popularly employed in several applications especially in soccer player robots considered in Robocup competitions. However, Omni directional navigation system, Omni-vision system and solenoid kicking mechanism in such mobile robots have not ever been combined. This situation brings the idea of a robot with no head direction into existence, a comprehensi...
متن کاملGathering Autonomous Mobile Robots in Non Totally Symmetric Conngurations
We study the problem of coordinating a set of autonomous mobile robots that can freely move in a two-dimensional plane; in particular, we want them to gather at a point not xed in advance (Gathering Problem). We introduce a model of weak robots (decentralized, asynchronous, no common knowledge, no identities, no central coordination, no direct communication, oblivious) which can observe the set...
متن کاملGathering Asynchronous Mobile Robots with Inaccurate Compasses
This paper considers a system of asynchronous autonomous mobile robots that can move freely in a two dimensional plane with no agreement on a common coordinate system. Startingfrom any initial configuration, the robots are required to eventually gather at a single point, notfixed in advance (gathering problem). Prior work has shown that gathering oblivious (i.e., stateless) robots cannot be ac...
متن کامل